Note—A Note on “Lot Size Scheduling on a Single Machine for Stochastic Demand” by Goyal
نویسندگان
چکیده
منابع مشابه
Stochastic Optimal Scheduling of Microgrids Considering Demand Response and Commercial Parking Lot by AUGMECON Method
Regarding the advances in technology and anxieties around high and growing prices of fossil fuels, government incentives increase to produce cleaner and sustainable energy through distributed generations. This makes trends in the using microgrids which consist of electric demands and different distributed generations and energy storage systems. The optimum operation of microgrids with consideri...
متن کاملA note on "Single-machine scheduling with general learning functions"
The recent paper ‘‘Single-machine scheduling with general learning functions’’ (Wang [1]) addresses the single-machine scheduling problems with a sum-of-processing-times-based learning effect. The author showed that that the shortest processing time (SPT) rule is optimal for the sum of completion times square minimization problem. He also showed by examples that the optimal schedule for the cla...
متن کاملShort Note on Scheduling on a Single Machine with one Non-availability Period
We consider scheduling on a single machine with one non-availability period to minimize the weighted sum of completion times. We provide a preemptive algorithm with an approximation ratio arbitrarily close to the Golden Ratio, (1+ √ 5)/2+ε, which improves on a previously best known 2approximation. The non-preemptive version of the same algorithm yields a (2 + ε)-approximation.
متن کاملA Stochastic Lot-Sizing and Scheduling Model
Companies are trying to improve their ability to deliver and to reduce their production costs simultaneously. Nevertheless ongoing orders of customers are causing difficulties to deliver because of bottlenecks in the production. Furthermore constantly incoming customer orders effect that every actual optimal production plan with its already realized and planned guidelines has induced states tha...
متن کاملSingle machine stochastic appointment sequencing and scheduling
We develop algorithms for a single machine stochastic appointment sequencing and scheduling problem with waiting time, idle time, and overtime costs. This is a basic stochastic scheduling problem that has been studied in various forms by several previous authors. Applications for this problem cited previously include scheduling of surgeries in an operating room (Denton, 2007, Denton and Gupta,2...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Management Science
سال: 1976
ISSN: 0025-1909,1526-5501
DOI: 10.1287/mnsc.22.7.823